An Approximation Algorithm for Connected Dominating Set in Ad Hoc Networks
نویسندگان
چکیده
The construction of a virtual backbone for ad hoc networks is modelled by connected dominating set (CDS) in unit-disk graphs. This paper introduces a novel idea to compute CDS effectively our algorithm does not include the members of an existing maximal independent set (MIS) even though it does connect the MIS. Popular approaches in literature count the MIS in the resultant CDS. Therefore it is possible that our new algorithm has better performance ratio.
منابع مشابه
Distributed Construction of Weakly Connected Dominating Sets for Clustering Mobile Ad Hoc Networks
Weakly connected dominating set (WCDS) has been proposed to cluster mobile ad hoc networks and be used as a virtual backbone. There have been some distributed approximation algorithms proposed in the literature for minimum WCDS. But none of them have constant approximation factors. Thus these algorithms can not guarantee to generate a WCDS of small size. Their message complexities may also be a...
متن کاملMaintaining weakly-connected dominating sets for clustering ad hoc networks
An ad hoc network is a multihop wireless communication network supporting mobile users. Network performance degradation is a major problem as the network becomes larger. Clustering is an approach to simplify the network structure and thus alleviate the scalability problem. One method that has been proposed to form clusters is to use weaklyconnected dominating sets [Y.P. Chen, A.L. Liestman, App...
متن کاملA polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks
A connected dominating set in a graph is a subset of vertices such that every vertex is either in the subset or adjacent to a vertex in the subset and the subgraph induced by the subset is connected. A minimum-connected dominating set is such a vertex subset with minimum cardinality. An application in ad hoc wireless networks requires the study of the minimum-connected dominating set in unit-di...
متن کاملTighter Approximation Bounds for Minimum CDS in Wireless Ad Hoc Networks
Connected dominating set (CDS) has a wide range of applications in wireless ad hoc networks. A number of approximation algorithms for constructing a small CDS in wireless ad hoc networks have been proposed in the literature. The majority of these algorithms follow a general two-phased approach. The first phase constructs a dominating set, and the second phase selects additional nodes to interco...
متن کاملStrategic Location-based Connected Dominating Set for Mobile Ad Hoc Networks
Wireless networks like mobile ad hoc networks are infrastructure-less networks and nodes in that network which communicate via radio propagation. In such networks, a Connected Dominating Set (CDS) can act as a virtual backbone, in order to make the routing efficient. A smaller virtual backbone incurs less communication overhead. Since computing a minimum CDS is NP-Complete, efficient approximat...
متن کامل